On Multiobjective H 2 / H m Optimal Control
نویسنده
چکیده
In this paper the solutions to the optimal multiobjective H 2 / H D 0 problem are characterized using Banach space duality theory, and shown to satisfy a flatness or allpass condition. Dual and predual spaces are identified, and equivalent maximizations formulated therein. The duality description leads naturally to a solution based on convex programming.
منابع مشابه
Multiobjective Optimal Structural Control of the Notre Dame Building Model Benchmark
Reduced-order, multiobjective optimal controllers are developed for the Notre Dame structural control building model benchmark. Standard H 2 /LQG optimal control excels at noise and disturbance rejection, but may have difficulty with actuator saturation and plant uncertainty. The benchmark problem is adapted to a multiobjective optimal control framework, using l 1 and H ∞ constraints to improve...
متن کاملMultiobjective H2/H Control Design for a VSTOL Flight Model
In this paper, an application of a multiobjective optimal controller design approach on a multivariable vertical short takeoff and landing (VSTOL) aircraft system is presented. To achieve good performance subject to white noises, bounded power disturbances, and to model uncertainties, and to have an acceptable reference tracking, combination of both H2(LQG) and H methods is used. This method us...
متن کاملA Convex Programming Approach to the Multiobjective H2/H” Problem
In this paper, Banach space duality theory for the multiobjective H 2 / H m problem developed recently by the authors, is used to develop algorithms to solve this problem by approximately reducing the dual and predual reperesentations to finite variable convex optimizations. The Ellipsoid algorithm is then a p plied to these problems to obtain polynomial-time, nonheuristic programs which find “...
متن کاملMultiobjective H 2 =h 1 -optimal Control via Finite Dimensional Q-parametrization and Linear Matrix Inequalities
The problem of multiobjective H2=H1 optimal controller design is reviewed. There is as yet no exact solution to this problem. We present a method based on that proposed by Scherer 14]. The problem is formulated as a convex semidef-inite program (SDP) using the LMI formulation of the H2 and H1 norms. Suboptimal solutions are computed using-nite dimensional Q-parametrization. The objective value ...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کامل